FOLL-E: Teaching First Order Logic to Children
نویسندگان
چکیده
First-order logic (FO) is an important foundation of many domains, including computer science and artificial intelligence. In recent efforts to teach basic CS AI concepts children, FO has so far remained absent. this paper, we examine whether it possible design a learning environment that both motivates enables children learn the basics FO. The key components are syntax-free blocks-based notation for FO, graphics-based puzzles solve, tactile which uses vision allow work with wooden blocks. resulting FOLL-E system intended sharpen childrens' reasoning skills, encourage critical thinking make them aware ambiguities natural language. During preliminary testing they reported found intuitive inviting, enjoyed interacting application.
منابع مشابه
From Separation Logic to First-Order Logic
Separation logic is a spatial logic for reasoning locally about heap structures. A decidable fragment of its assertion language was presented in [1], based on a bounded model property. We exploit this property to give an encoding of this fragment into a first-order logic containing only the propositional connectives, quantification over the natural numbers and equality. This result is the first...
متن کاملBeyond First Order Logic: From number of structures to structure of numbers: Part I
We study the history and recent developments in nonelementarymodel theory focusing on the framework of abstractelementary classes. We discuss the role of syntax and semanticsand the motivation to generalize first order model theory to nonelementaryframeworks and illuminate the study with concrete examplesof classes of models. This first part introduces the main conceps and philosophies anddiscu...
متن کاملBeyond first order logic: From number of structures to structure of numbers: Part II
We study the history and recent developments in nonelementarymodel theory focusing on the framework of abstractelementary classes. We discuss the role of syntax and semanticsand the motivation to generalize first order model theory to nonelementaryframeworks and illuminate the study with concrete examplesof classes of models. This second part continues to study the question of catecoricitytrans...
متن کاملTaming First-Order Logic
In this paper we define computationally well-behaved versions of classical first-order logic and prove that the validity problem is decidable1.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence
سال: 2023
ISSN: ['2159-5399', '2374-3468']
DOI: https://doi.org/10.1609/aaai.v37i13.26884